New Optimal Constant Weight Codes
نویسندگان
چکیده
In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by filling in 9 missing constant weight codes, all of which are optimal by the second Johnson bound. This completes the tables for A(n, 16, 9) and A(n, 18, 10) up to n = 63 and corrects some A(n, 14, 8).
منابع مشابه
New explicit binary constant weight codes from Reed-Solomon codes
Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from q-ary ReedSolomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant ...
متن کاملLinear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...
متن کاملOptimal (v, 3, 1) binary cyclically permutable constant weight codes with small v
We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; b(v − 1)/6c) difference packings, and optimal (v, 3, 1) optical orthogonal codes. Therefore the classif...
متن کاملOptimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$
Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...
متن کاملTwo Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An n-bit s-deletion correcting code is an independent set in a particular graph. We propose constructing such a code by taking the union of many constant Hamming weight codes. This results in codes that have additional structure. Searching for codes in constant Hamming weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 14 شماره
صفحات -
تاریخ انتشار 2007